Construction of [2k-1+k, k, 2k-1+1] Codes Attaining Griesmer Bound and Its Locality
نویسندگان
چکیده
منابع مشابه
A computational approach for solving y2 =1k + 2k + ... + xk
We present a computational approach for finding all integral solutions of the equation y2 = 1k + 2k + · · ·+xk for even values of k. By reducing this problem to that of finding integral solutions of a certain class of quartic equations closely related to the Pell equations, we are able to apply the powerful computational machinery related to quadratic number fields. Using our approach, we deter...
متن کاملThe Construction and Viterbi Decoding of New (2k, k, l) Convolutional Codes
Abstract—The free distance of (n, k, l) convolutional codes has some connection with the memory length, which depends on not only l but also on k. To efficiently obtain a large memory length, we have constructed a new class of (2k, k, l) convolutional codes by (2k, k) block codes and (2, 1, l) convolutional codes, and its encoder and generation function are also given in this paper. With the he...
متن کاملEfficient Construction of 2K+ Graphs
I. INTRODUCTION Researchers often need to generate synthetic graphs with key properties resembling those of networks of interest. This is for example the case when the full topology is unavailable or impractical to measure or use. In our work, we are interested in generating graphs that resemble online social networks in terms of their joint degree distribution (JDM) and their degree-dependent ...
متن کاملA Combinatorial Proof of a Relationship Between Maximal $(2k-1, 2k+1)$-Cores and $(2k-1, 2k, 2k+1)$-Cores
Integer partitions which are simultaneously t–cores for distinct values of t have attracted significant interest in recent years. When s and t are relatively prime, Olsson and Stanton have determined the size of the maximal (s, t)-core κs,t. When k > 2, a conjecture of Amdeberhan on the maximal (2k − 1, 2k, 2k + 1)-core κ2k−1,2k,2k+1 has also recently been verified by numerous authors. In this ...
متن کاملPropelinear structure of Z_{2k}-linear codes
Let C be an additive subgroup of Z n 2k for any k ≥ 1. We define a Gray map Φ : Z n 2k −→ Z kn 2 such that Φ(C) is a binary propelinear code and, hence, a Hamming-compatible group code. Moreover, Φ is the unique Gray map such that Φ(C) is Hamming-compatible group code. Using this Gray map we discuss about the nonexistence of 1-perfect binary mixed group code.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Korean Institute of Communications and Information Sciences
سال: 2015
ISSN: 1226-4717
DOI: 10.7840/kics.2015.40.3.491